Two-Way Finite Automata And Dependency Grammar: A Parsing Method For Inflectional Free Word Order Languages
نویسندگان
چکیده
This paper presents a parser of an inflectional free word order language, namely Finnish. Two-way finite automata are used to specify a functional dependency grammar and to actually parse Finnish sentences. Each automaton gives a functional description of a dependency structure within a constituent. Dynamic local control of the parser is realized by augmenting the automata with simple operations to make the automata, associated with the words of an input sentence, activate one another.
منابع مشابه
تأثیر ساخت‌واژه‌ها در تجزیه وابستگی زبان فارسی
Data-driven systems can be adapted to different languages and domains easily. Using this trend in dependency parsing was lead to introduce data-driven approaches. Existence of appreciate corpora that contain sentences and theirs associated dependency trees are the only pre-requirement in data-driven approaches. Despite obtaining high accurate results for dependency parsing task in English langu...
متن کاملFeature Engineering in Persian Dependency Parser
Dependency parser is one of the most important fundamental tools in the natural language processing, which extracts structure of sentences and determines the relations between words based on the dependency grammar. The dependency parser is proper for free order languages, such as Persian. In this paper, data-driven dependency parser has been developed with the help of phrase-structure parser fo...
متن کاملA Right-to-Left Chart Parsing for Dependency Grammar using Headable Paths
In this paper, we propose a right-to-left dependency grammar parsing method for languages in which a governor appears after its modiier like Korean and Japanese. Unlike conventional left-to-right parsers, this parsing method can take advantage of the governor post-positioning property of such languages to reduce the size of search space by using the idea of a head-able path. A headable path is ...
متن کاملExperiments with Easy-first nonprojective constituent parsing
Less-configurational languages such as German often show not just morphological variation but also free word order and nonprojectivity. German is not exceptional in this regard, as other morphologically-rich languages such as Czech, Tamil or Greek, offer similar challenges that make context-free constituent parsing less attractive. Advocates of dependency parsing have long pointed out that the ...
متن کاملA Grammar Based Approach To A Grammar Checking Of Free Word Order Languages
This paper shows one of the methods used for grammar checking, as it is being developed in the frame of the EC funded project LATESLAV -Language Technology li)r Slavic Languages (PECO 2824). The languages under consideration in the project Czech and Bulgarian are both free word order languages, therefore it is not sufficient to use only simple pattern based methods for error checking. The empha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1984